Partial Automata and Finitely Generated Congruences An Extension of Nerode s Theorem
نویسنده
چکیده
Let T be the set of ground terms over a nite ranked alphabet We de ne partial automata on T and prove that the nitely gener ated congruences on T are in one to one correspondence up to iso morphism with the nite partial automata on T with no inaccessible and no inessential states We give an application in term rewriting every ground term rewrite system has a canonical equivalent system that can be constructed in polynomial time in Logical Methods in Honor of Anil Nerode s Sixtieth Birthday ed J N Crossley J B Remmel R A Shore and M E Sweedler Birkh auser Boston
منابع مشابه
Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملA Homomorphism Concept for ω -Regularity
The Myhill-Nerode Theorem (that for any regular language, there is a canonical recognizing device) is of paramount importance for the computational handling of many formalisms about finite words. For infinite words, no prior concept of homomorphism or structural comparison seems to have generalized the Myhill-Nerode Theorem in the sense that the concept is both language preserving and represent...
متن کاملThe Myhill-Nerode Theorem Based on Regular Expressions
There are many proofs of the Myhill-Nerode theorem using automata. In this library we give a proof entirely based on regular expressions, since regularity of languages can be conveniently defined using regular expressions (it is more painful in HOL to define regularity in terms of automata). We prove the first direction of the MyhillNerode theorem by solving equational systems that involve regu...
متن کاملA Myhill-Nerode theorem for automata with advice
Consider an extension of the classical model of finite automata operating on finite strings in which the machine simultaneously reads a fixed advice tape — an infinite string A. A deterministic finite-string automaton with advice A is like a deterministic finite-string automaton, except that at step n the next state depends on the current state, the nth symbol of the input w ∈ Σ∗, and the nth s...
متن کاملAutomata on Guarded Strings and Applications
Guarded strings are like ordinary strings over a finite alphabet P, except that atoms of the free Boolean algebra on a set of atomic tests B alternate with the symbols of P. The regular sets of guarded strings play the same role in Kleene algebra with tests as the regular sets of ordinary strings do in Kleene algebra. In this paper we develop the elementary theory of finite automata on guarded ...
متن کامل